منابع مشابه
on the effect of linear & non-linear texts on students comprehension and recalling
چکیده ندارد.
15 صفحه اولContainment and Inscribed Simplices
Let K and L be compact convex sets in Rn. The following two statements are shown to be equivalent: (i) For every polytope Q ⊆ K having at most n+ 1 vertices, L contains a translate of Q. (ii) L contains a translate of K. Let 1 ≤ d ≤ n − 1. It is also shown that the following two statements are equivalent: (i) For every polytope Q ⊆ K having at most d+ 1 vertices, L contains a translate of Q. (i...
متن کاملA linear-time algorithm for the maximum-area inscribed triangle in a convex polygon
Given the n vertices of a convex polygon in cyclic order, can the triangle of maximum area inscribed in P be determined by an algorithm with O(n) time complexity? A purported linear-time algorithm by Dobkin and Snyder from 1979 has recently been shown to be incorrect by Keikha, Löffler, Urhausen, and van der Hoog. These authors give an alternative algorithm with O(n log n) time complexity. Here...
متن کاملEnumeration of inscribed polyominos
We introduce a new family of polyominos that are inscribed in a rectangle of given size for which we establish a number of exact formulas and generating functions. In particular, we study polyominos inscribed in a rectangle with minimum area and minimum area plus one. These results are then used for the enumeration of lattice trees inscribed in a rectangle with minimum area plus one. Résumé. No...
متن کاملAutomatic control for evacuating anaerobic jars.
Displacement of oxygen by an inert gas is a method for attaining anaerobiosis which is preferred by many bacteriology laboratories because of the low cost of the process, and because of the small but real danger of explosion when the alternative, hydrogen with ignition, is used. Several cycles of evacuation and filling are necessary; usually, oxygen-free nitrogen is used with a final charge of ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Kadmos
سال: 2013
ISSN: 1613-0723,0022-7498
DOI: 10.1515/kadmos-2013-0005